Combining points and tangents into parabolic polygons: an affine invariant model for plane curves

نویسندگان

  • MARCOS CRAIZER
  • THOMAS LEWINER
  • JEAN-MARIE MORVAN
  • M. Craizer
  • T. Lewiner
چکیده

Image and geometry processing applications estimate the local geometry of objects using information localized at points. They usually consider information about the tangents as a side product of the points coordinates. This work proposes parabolic polygons as a model for discrete curves, which intrinsically combines points and tangents. This model is naturally affine invariant, which makes it particularly adapted to computer vision applications. As a direct application of this affine invariance, this paper introduces an affine curvature estimator that has a great potential to improve computer vision tasks such as matching and registering. As a proof–of–concept, this work also proposes an affine invariant curve reconstruction from point and tangent data.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finite Laguerre Near-planes of Odd Order Admitting Desarguesian Derivations

From this definition it readily follows that a Laguerre plane of order n has n + 1 generators, that every circle contains exactly n + 1 points and that there are n3 circles. All known models of finite Laguerre planes are of the following form. Let O be an oval in the Desarguesian projective plane P2 = PG(2, pm), p a prime. Embed P2 into threedimensional projective space P3 = PG(3, pm) and let v...

متن کامل

Efficient elliptic curve cryptosystems

Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...

متن کامل

Liouville-Arnold integrability of the pentagram map on closed polygons

The pentagram map is a discrete dynamical system defined on the moduli space of polygons in the projective plane. This map has recently attracted a considerable interest, mostly because its connection to a number of different domains, such as: classical projective geometry, algebraic combinatorics, moduli spaces, cluster algebras and integrable systems. Integrability of the pentagram map was co...

متن کامل

Partial Innation of Closed Polygons in the Plane

Innation for simply closed regular curves in the plane has been investigated rst by S. A. Robertson 4] and studied in some more detail in 5]. It consists of an innnite iteration of reeections of parts of the curve at supporting double tangents, hopefully leading to a convex limit curve which has the same arc length as the original curve. The same procedure easily can be deened for simply closed...

متن کامل

A Census of Convex Lattice Polygons with at most one

We find all convex lattice polygons in the plane (up to equivalence) with at most one interior lattice point. A lattice point in the plane is a point with integer coordinates. A lattice segment is a line segment whose endpoints are lattice points. A lattice polygon is a simple polygon whose vertices are lattice points. In 1980, Arkinstall [1] proved that, up to lattice equivalence (defined belo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006